The convex decomposition of arbitrary planar polygon 任意平面多边形的凸分解。
After deeply studying current relative algorithms, and adopting the ideas of advanced decomposition algorithms, a convex decomposition algorithm for arbitrary planar polygons is put forward in the dissertation, which is based on the algorithm of nearest bridging and the ideas of second bridging and loop division 本文通过对国内外相关算法的深入研究,借鉴先进剖分算法的思想,提出了基于环分割的任意平面多边形的凸分解算法,包括最近搭桥算法、二次搭桥思想和环分割思想。